Interval lengths for interval orders: A minimization problem
نویسندگان
چکیده
منابع مشابه
Minimization of Open Orders Using Interval Graphs
In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being p...
متن کاملOn Generalized Interval Orders
In this paper, we introduce the notion of generalized interval order (GIO) which extends the notion of interval order in non-transitive binary relations. This allow us to extend the classical representation theorem of Fishburn in [5]. We also provide sufficient conditions which ensure the existence of the Generalized Optimal Choice Set (GOCS) of GIOs. Finally, we characterize the existence of t...
متن کاملInterval orders and dimension
We show that for every interval order X , there exists an integer t so that if Y is any interval order with dimension at least t, then Y contains a subposet isomorphic to X .
متن کاملHomothetic interval orders
We give a characterization of the non-empty binary relations  on a N∗-set A such that there exist two morphisms of N∗-sets u1, u2 : A → R+ verifying u1 ≤ u2 and x  y ⇔ u1(x) > u2(y). They are called homothetic interval orders. If  is a homothetic interval order, we also give a representation of  in terms of one morphism of N∗-sets u : A → R+ and a map σ : u(R+) × A → R+ such that x  y ⇔ σ(...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90072-9